Shared Packages Through Linda
نویسندگان
چکیده
This paper describes a method to implement the functionality of shared passive packages on top of a logical distributed memory — Linda. From a shared passive package a compiler can construct a new normal package that replaces the shared passive package. The new package contains the same subprograms and is extended with abstract data structures mapping Ada objects onto the storage units of Linda. A short program example is included to illustrate the construction process.
منابع مشابه
Deriving User Interface Requirements from Densely Interleaved Scientific Computing Applications
Deriving user interface requirements is a key step in user interface generation and maintenance. For single purpose numeric routines user interface requirements are relatively simple to derive. However, general numeric packages, which are solvers for entire classes of problems, are densely interleaved with strands shared and mixed among user options. This complexity forms a significant barrier ...
متن کاملFast Message Passing via the ALLCACHE Memory on KSR Computers
A large body of applications have been built which use a message-passing style of inter-process communication. Thus, it is important to be able to support eecient message-passing even on shared-memory computers. Unfortunately, `direct' porting of message-passing packages to shared-memory computers invariably produces unacceptably poor performance. In this paper, we discuss schemes for eeciently...
متن کاملImplementing cooperative software with high-level communication packages
The use of appropriate tools is crucial for the development of robust and distributed software. The programming of heterogeneous environments is more demanding than programming single, stand-alone computers. We believe that client/server technology is not a satisfactory solution. Most problems do not naturally decompose into an asymmetric client/server structure. Better abstraction mechanisms a...
متن کاملInvestigating Parallel Interpretation-Tree Model Matching Algorithms with ProSet-Linda
This paper discusses the development of algorithms for parallel interpretation-tree model matching for 3-D computer vision applications such as object recognition. The algorithms are developed with a prototyping approach using ProSet-Linda. ProSet is a procedural prototyping language based on the theory of nite sets. The coordination language Linda provides a distributed shared memory model, ca...
متن کاملAn Extensible Space-Based Coordination Approach for Modeling Complex Patterns in Large Systems,
Coordination is frequently associated with shared data spaces employing Linda coordination. But in practice, communication between parallel and distributed processes is carried out with message exchange patterns. What, actually, do shared data spaces contribute beyond these? In this paper we present a formal representation for a definition of shared spaces by introducing an “extensible tuple mo...
متن کامل